On Computational Aspects of Tchebichef Polynomials for Higher Polynomial Order
نویسندگان
چکیده
منابع مشابه
Higher-Order Aspects in Order
In aspect-oriented programming languages, advice evaluation is usually considered as part of the base program evaluation. This is also the case for certain pointcuts, such as if pointcuts in AspectJ, or simply all pointcuts in higher-order aspect languages like AspectScheme. While viewing pointcuts and advice as base level computation clearly distinguishes AOP from reflection, it also comes at ...
متن کاملPolynomial Interpretations for Higher-Order Rewriting
The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative formalism of algebraic functional systems, where the simply-typed λ-calculus is combined with algebraic reduction. Using this theory, we define higher-order ...
متن کاملHigher-Order Computational Logic
This paper presents the case for the use of higher-order logic as a foundation for computational logic. A suitable polymorphicallytyped, higher-order logic is introduced and its syntax and proof theory briefly described. In addition, a metric space of closed terms suitable for knowledge representation purposes is presented. The approach to representing individuals is illustrated with some examp...
متن کاملHigher Order Degenerate Hermite-Bernoulli Polynomials Arising from $p$-Adic Integrals on $mathbb{Z}_p$
Our principal interest in this paper is to study higher order degenerate Hermite-Bernoulli polynomials arising from multivariate $p$-adic invariant integrals on $mathbb{Z}_p$. We give interesting identities and properties of these polynomials that are derived using the generating functions and $p$-adic integral equations. Several familiar and new results are shown to follow as special cases. So...
متن کاملComputational aspects of multivariate polynomial interpolation
The paper is concerned with the practical implementation of two methods to compute the solution of polynomial interpolation problems. In addition to a description of the implementation, practical results and several improvements will be discussed, focusing on speed and robustness of the algorithms under consideration.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2669218